Fast Planar Harmonic Deformations with Alternating Tangential Projections

نویسندگان

  • Eden Fedida Hefetz
  • Edward Chien
  • Ofir Weber
چکیده

We present a planar harmonic cage-based deformation method with local injectivity and bounded distortion guarantees, that is significantly faster than state-of-the-art methods with similar guarantees, and allows for real-time interaction. With a convex proxy for a near-convex characterization of the bounded distortion harmonic mapping space from [LW16], we utilize a modified alternating projection method (referred to as ATP) to project to this proxy. ATP draws inspiration from [KABL15] and restricts every other projection to lie in a tangential hyperplane. In contrast to [KABL15], our convex setting allows us to show that ATP is provably convergent (and is locally injective). Compared to the standard alternating projection method, it demonstrates superior convergence in fewer iterations, and it is also embarrassingly parallel, allowing for straightforward GPU implementation. Both of these factors combine to result in unprecedented speed. The convergence proof generalizes to arbitrary pairs of intersecting convex sets, suggesting potential use in other applications. Additional theoretical results sharpen the near-convex characterization that we use and demonstrate that it is homeomorphic to the bounded distortion harmonic mapping space (instead of merely being bijective).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Harmonic Bergman Functions on Half-spaces

We study harmonic Bergman functions on the upper half-space of Rn. Among our main results are: The Bergman projection is bounded for the range 1 < p <∞; certain nonorthogonal projections are bounded for the range 1 ≤ p < ∞; the dual space of the Bergman L1-space is the harmonic Bloch space modulo constants; harmonic conjugation is bounded on the Bergman spaces for the range 1 ≤ p <∞; the Bergma...

متن کامل

A Higher Order B-Splines 1-D Finite Element Analysis of Lossy Dispersive Inhomogeneous Planar Layers

In this paper we propose an accurate and fast numerical method to obtain scattering fields from lossy dispersive inhomogeneous planar layers for both TE and TM polarizations. A new method is introduced to analyze lossy Inhomogeneous Planar Layers. In this method by applying spline based Galerkin’s method of moment to scalar wave equation and imposing boundary conditions we obtain reflection and...

متن کامل

A fast alternating projection method for complex frequency estimation

The problem of approximating a sampled function using sums of a fixed number of complex exponentials is considered. We use alternating projections between fixed rank matrices and Hankel matrices to obtain such an approximation. Convergence, convergence rates and error estimates for this technique are proven, and fast algorithms are developed. We compare the numerical results obtain with the MUS...

متن کامل

Ultra-Fast Image Reconstruction of Tomosynthesis Mammography Using GPU

Digital Breast Tomosynthesis (DBT) is a technology that creates three dimensional (3D) images of breast tissue. Tomosynthesis mammography detects lesions that are not detectable with other imaging systems. If image reconstruction time is in the order of seconds, we can use Tomosynthesis systems to perform Tomosynthesis-guided Interventional procedures. This research has been designed to study u...

متن کامل

Non-peripheral Ideal Decompositions of Alternating Knots

An ideal triangulation T of a hyperbolic 3-manifold M with one cusp is non-peripheral if no edge of T is homotopic to a curve in the boundary torus of M . For such a triangulation, the gluing and completeness equations can be solved to recover the hyperbolic structure of M . A planar projection of a knot gives four ideal cell decompositions of its complement (minus 2 balls), two of which are id...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Comput. Graph. Forum

دوره 36  شماره 

صفحات  -

تاریخ انتشار 2017